Signed Formula Logic Programming
نویسندگان
چکیده
Signed formula can be used to reason about a wide variety of multiple-valued logics. The formal theoretical foundation of logic programming based on signed formulas is developed in 26]. In this paper, the operational semantics of signed formula logic programming is investigated through constraint logic programming. Applications to bilattice logic programming and truth-maintenance are considered.
منابع مشابه
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming, which can be embedded into the first. The underlying basic idea is to generalise the classical notion of a literal by adorning an atomic formula with a sign or label which in general consists of a possibly ordered se...
متن کاملThe 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the form S : p, where p is a classical atom and S, its sign, is a subset of a domain N . The informal meaning is “p takes one of the values in S”. Applications for deduction in signed logics derive from those of annotated...
متن کاملKripke-Style Semantics for Normal Systems
In this paper we describe a generalized framework of sequent calculi, called normal systems, which is suitable for a wide family of propositional logics. This family includes classical logic, several modal logics, intuitionistic logic, its dual, bi-intuitionistic logic, and various finite-valued logics. We present a general method for providing a non-deterministic finite-valued Kripke-style sem...
متن کاملThe Sat Problem of Signed Cnf Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalised notion of literal, called signed literal. A signed literal is an expression of the form S : p, where p is a classical atom and S, its sign, is a subset of a domain N . The informal meaning is “p takes one of the values in S”. Signed formulas are a logical language for knowledge representation ...
متن کاملReducing signed propositional formulas
New strategies of reduction for finite valued propositional logics are introduced in the framework of the TAS methodology developed by the authors [1]. A new data structure, the ∆̂-sets, is introduced to store information about the formula being analysed, and its usefulness is shown by developing efficient strategies to decrease the size of signed propositional formulas, viz. new criteria to det...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995